Binary sequences with period N and nonlinear complexity N − 2
نویسندگان
چکیده
منابع مشابه
Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity
The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the k-error linear complexity distribution of 2-periodic binary sequences is investigated based on Games-Chan algorithm. First, for k = 2, 3, the complete countin...
متن کاملLow Complexity Converter for the Moduli Set {2^n+1,2^n-1,2^n} in Two-Part Residue Number System
Residue Number System is a kind of numerical systems that uses the remainder of division in several different moduli. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers will increase the speed of the arithmetic operations in this system. However, the main factor that affects performance of system is hardware complexity of reverse converter. Reverse co...
متن کاملThe $$k$$ -error linear complexity distribution for $$2^n$$ -periodic binary sequences
The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period 2n, one could convert the computation of kerror linear complexity into finding error sequences with minimal Hamming weight. Based on Games-C...
متن کاملStructure Analysis on the $k$-error Linear Complexity for $2^n$-periodic Binary Sequences
In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for 2-periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed k-error cube decomposition, and the famous inclusion-exclusion principle, we obtain the complete characterization of ith descent point (critical point) of the k-error linear complexity for ...
متن کاملOn the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory
The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and k-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable k-error linear complexity is proposed to study sequences with stable and large k-error linear complexity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2018
ISSN: 1936-2447,1936-2455
DOI: 10.1007/s12095-018-0324-3